منابع مشابه
Biclique Covers and Partitions
The biclique cover number (resp. biclique partition number) of a graph G, bc(G) (resp. bp(G)), is the least number of bicliques—complete bipartite subgraphs—that are needed to cover (resp. partition) the edges of G. The local biclique cover number (resp. local biclique partition number) of a graph G, lbc(G) (resp. lbp(G)), is the least r such that there is a cover (resp. partition) of the edges...
متن کاملFractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc∗(G), and the fractional biclique partition number, bp∗(G), of a graph G. It is observed that bc∗(G) and bp∗(G) provide lower bounds on the biclique cover and partition numbers respectively, and conditions for equality are given. It is also shown that bc∗(G) is a better lower ...
متن کاملChromatic characterization of biclique covers
A biclique B of a simple graph G is the edge-set of a complete bipartite subgraph of G. A biclique cover of G is a collection of bicliques covering the edge-set of G. Given a graph G, we will study the following problem: find the minimum number of bicliques which cover the edge-set of G. This problem will be called the minimum biclique cover problem (MBC). First, we will define the families of ...
متن کاملOrdered Biclique Partitions and Communication Complexity Problems
An ordered biclique partition of the complete graph Kn on n vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of Kn is covered by at least one and at most two bicliques in the collection, and (ii) if an edge e is covered by two bicliques then each endpoint of e is in the first class in one of these bicliques and in the second class in other one. In...
متن کاملSecure Frameproof Codes Through Biclique Covers
For a binary code of length v, a v-word w produces by a set of codewords {w, . . . , w} ✓ if for all i = 1, . . . , v, we have wi 2 {w i , . . . , w i }. We call a code r-secure frameproof of size t if | | = t and for any v-word that is produced by two sets C1 and C2 of size at most r, then the intersection of these sets is non-empty. A d-biclique cover of size v of a graph G is a collection of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/3595